Heyting algebras with Boolean operators for rough sets and information retrieval applications
نویسندگان
چکیده
منابع مشابه
Heyting algebras with Boolean operators for rough sets and information retrieval applications
This paper presents an algebraic formalism for reasoning on finite increasing sequences over Boolean algebras in general and on generalizations of Rough Set concepts in particular. We argue that these generalizations are suitable for modeling relevance of documents in an Information Retrieval system.
متن کاملVocabulary mining for information retrieval: rough sets and fuzzy sets
Vocabulary mining in information retrieval refers to the utilization of the domain vocabulary towards improving the user's query. Most often queries posed to information retrieval systems are not optimal for retrieval purposes. Vocabulary mining allows one to generalize, specialize or perform other kinds of vocabulary based transformations on the query in order to improve retrieval performance....
متن کاملMartin Frontal operators in weak Heyting algebras
In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [10]. A frontal operator in a weak Heyting algebra A is an expansive operator τ preserving finite meets which also satisfies the equation τ(a) ≤ b ∨ (b → a), for all a, b ∈ A. These operators were studied from an algebraic, logical an...
متن کاملRough sets and Boolean reasoning
In this article, we discuss methods based on the combination of rough sets and Boolean reasoning with applications in pattern recognition, machine learning, data mining and conflict analysis. 2006 Elsevier Inc. All rights reserved.
متن کاملRough operations on Boolean algebras
In this paper, we introduce two pairs of rough operations on Boolean algebras. First we define a pair of rough approximations based on a partition of the unity of a Boolean algebra. We then propose a pair of generalized rough approximations on Boolean algebras after defining a basic assignment function between two different Boolean algebras. Finally, some discussions on the relationship between...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2008
ISSN: 0166-218X
DOI: 10.1016/j.dam.2007.08.050